例句與造句

1. The polynomial hierarchy can be defined recursively as
2. It is believed they are different, and this leads to the definition of the polynomial hierarchy.
3. If the polynomial hierarchy has any complete problems, then it has only finitely many distinct levels.
4. It is however known that if the problem is NP-complete then the polynomial hierarchy collapses to a finite level.
5. The languages in the polynomial hierarchy, "'PH "', correspond to all of second-order logic.
6. It's difficult to find polynomial hierarchy in a sentence. 用polynomial hierarchy造句挺難的
7. Translations from propositional default logic to classical propositional logic cannot always generate a polynomially sized propositional theory, unless the polynomial hierarchy collapses.
8. Hewitt's first experiments with inconsistency at Potrzebie lead to the accidental collapse of the polynomial hierarchy ( news report here ).
9. Again, the combination of these three results, as in the previous case, results in the collapse of the polynomial hierarchy.
10. This definition reflects the close connection between the polynomial hierarchy and the arithmetical hierarchy, where "'NP "', respectively.
11. In his many publications, Fortnow has contributed important results to the field of protocols for NP-complete languages unless the polynomial hierarchy collapses.
12. The complexity of query answering and model checking in the propositional case is in the second level of the polynomial hierarchy for most belief revision operators and schemas.
13. The problem of finding such a coloring belongs to \ Sigma _ 2 ^ P in the polynomial hierarchy, and again Manin showed that it is complete for this level.
14. When combined together these two facts along with the Toda's theorem result in the collapse of the polynomial hierarchy, which as mentioned above is highly unlikely to occur.
15. Each class in the polynomial hierarchy contains \ leq _ { \ rm m } ^ { \ rm P }-complete problems ( problems complete under polynomial-time many-one reductions ).
16. If a problem is in P / poly, then it can be solved in deterministic polynomial time provided that an BPP . If it contains NP, then the polynomial hierarchy collapses to the second level.
更多例句：  下一頁(yè)